Efficient Computation of Eigenvector Sensitivities for Structural Dynamics via Conjugate Gradients*
نویسنده
چکیده
An iterative procedure is presented for computing eigenvector sensitivities due to finite element model parameter variations. The present method is a Preconditioned Conjugate Projected Gradient-based technique and is intended to utilize the existing matrix factorizations developed for an iterative eigensolution such as Lanczos or Subspace Iteration. As such, this technique can be integrated into a coupled eigensolver/sensitivity software module and leverage the nonrecurring costs of the solver. The use of projection operators in the algorithm is dictated by the indefinite character of the governing coefficient matrix of the eigenvector derivative. Two model examples are provided to demonstrate both the accuracy of the present technique and its superior efficiency as compared to existing techniques with similar accuracy.
منابع مشابه
Conjugate gradient neural network in prediction of clay behavior and parameters sensitivities
The use of artificial neural networks has increased in many areas of engineering. In particular, this method has been applied to many geotechnical engineering problems and demonstrated some degree of success. A review of the literature reveals that it has been used successfully in modeling soil behavior, site characterization, earth retaining structures, settlement of structures, slope stabilit...
متن کاملAn Efficient Protocol for the Synthesis of Carboacyclic Nucleosides via Aza-Conjugate Addition Reaction
A new efficient method for the synthesis of carboacyclic nucleosides as biologically interesting compounds via aza-conjugate addition of pyrimidine nucleobases to a,β-unsaturated esters in the presence of catalytic amount of LiOH.H2O (1.2-4.8 mol%) under microwave irradiation is described. This method affords the title compounds in good to excellent yields and i...
متن کاملAccuracy of Computed Eigenvectors via Optimizing a Rayleigh Quotient 1 Accuracy of Computed Eigenvectors via Optimizing a Rayleigh Quotient
This note gives converses to the well-known result: for any vector e u such that sin (u; e u) = O( ), we have e u Ae u e u e u = + O( ) where is an eigenvalue and u is the corresponding eigenvector of a Hermitian matrix A, and \ " denotes complex conjugate transpose. It shows that if e u Ae u=e u e u is close to A's largest eigenvalue, then e u is close to the corresponding eigenvector with an ...
متن کاملComputing the lowest eigenvalues of the Fermion matrix by subspace iterations
provides the smallest eigenvalue, together with the corresponding eigenvector. The minimum of a functional can be found iteratively by the method of conjugate gradients (CG)[1], its application to the special case of the Ritz functional has been worked out by Geradin[2] and Fried[3]. If a small number of lowest eigenvalues is required instead, q(x) may be minimised repeatedly, restricting x to ...
متن کاملWave Sensitivities of Networks
Abstracf—A theoretical foundation is presented for the efficient computation of tirstand second-order sensitivities of networks with respect to network parameters in terms of wave variables. The concept of the adjoint network is used. First-order sensitivity formulas for a wide variety of elements are presented, including lumped and uniformly distributed elements, active and passive elements, a...
متن کامل